Variable Neighborhood Search for Extremal Graphs . 15 . On Bags and Bugs 1
نویسندگان
چکیده
Usual graph classes, such as complete graphs, paths, cycles and stars, frequently appear as extremal graphs in graph theory problems. Here we want to turn the reader’s attention to two novel, simply defined, graph classes that appear as extremal graphs in several graph theory problems. We call them bags and bugs. As examples of problems where bags and bugs appear, we show that balanced bugs maximize the index of graphs with fixed number of vertices and diameter ≥ 2, while odd bags maximize the index of graphs with fixed number of vertices and radius ≥ 3. AMS Classification: 05C35, 05C50
منابع مشابه
A Learning Optimization Algorithm in Graph Theory - Versatile Search for Extremal Graphs Using a Learning Algorithm
Using a heuristic optimization module based upon Variable Neighborhood Search (VNS), the system AutoGraphiX’s main feature is to find extremal or near extremal graphs, i.e., graphs that minimize or maximize an invariant. From the so obtained graphs, conjectures are found either automatically or interactively. Most of the features of the system relies on the optimization that must be efficient b...
متن کاملVariable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees
Chemical graphs, as other ones, are regular if all their vertices have the same degree. Otherwise, they are irregular, and it is of interest to measure their irregularity both for descriptive purposes and for QSAR/QSPR studies. Three indices have been proposed in the literature for that purpose: those of Collatz-Sinogowitz, of Albertson, and of Bell's variance of degrees. We study their propert...
متن کاملVariable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
We consider four conjectures related to the largest eigenvalue of (the adjacency matrix of) a graph (i.e., to the index of the graph). Three of them have been formulated after some experiments with the programming system AutoGraphiX (AGX), designed for finding extremal graphs with respect to given properties by the use of variable neighborhood search. The conjectures are related to the maximal ...
متن کاملOn oriented graphs with minimal skew energy
Let S(Gσ) be the skew-adjacency matrix of an oriented graph Gσ . The skew energy of Gσ is the sum of all singular values of its skew-adjacency matrix S(Gσ). This paper first establishes an integral formula for the skew energy of an oriented graph. Then, it determines all oriented graphs with minimal skew energy among all connected oriented graphs on n vertices with m (n ≤ m < 2(n− 2)) arcs, whi...
متن کاملEla Some Results on the Largest and Least
Let G = (V, E) be a simple graph with vertex set V (G) = {v1, v2, . . . , vn} and edge set E(G). In this paper, first some sharp upper and lower bounds on the largest and least eigenvalues of graphs are given when vertices are removed. Some conjectures in [M. Aouchiche. Comparaison Automatisée d’Invariants en Théorie des Graphes. Ph.D. Thesis, École Polytechnique de Montréal, February 2006.] an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005